An Approximation Algorithm to Find the Largest Linearly Separable Subset of Training Examples
نویسندگان
چکیده
We present an approximation algorithm for the NP-hard problem of finding the largest linearly separable subset of examples among a training set. The algorithm uses, incrementally, a Linear Programming procedure. We present numerical evidence of its superiority over the Pocket algorithm used by many neural net constructive algorithms.
منابع مشابه
MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several problems that can be formulated as the minimization of a set of inequalities. We propose in this work a new algorithm that is based on finding a unate subset of the input examples, with which then train a perceptron to fi...
متن کاملOn learning simple neural concepts: from halfspace intersections to neural decision lists
In this paper, we We a close look at the problem of l&ing simple neural concepts under the uniform diseibution of examples By simple neural concepts we mean concepts that can be represented as simple combinations of perceptrons (halfspaces). One such class of concepts is the class of halfspace intersections. By formalizing the problem of learning halfspace in&ections as a sei-coveringproblem. w...
متن کاملA Two Level Approximation Technique for Structural Optimization
This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...
متن کاملFeature Selection in Structural Health Monitoring Big Data Using a Meta-Heuristic Optimization Algorithm
This paper focuses on the processing of structural health monitoring (SHM) big data. Extracted features of a structure are reduced using an optimization algorithm to find a minimal subset of salient features by removing noisy, irrelevant and redundant data. The PSO-Harmony algorithm is introduced for feature selection to enhance the capability of the proposed method for processing the measure...
متن کاملFeature Extraction on Binary Patterns
pattern. Using 10 examples of each of the ten patterns, eigenvectors were calculated corresponding to the largest eigenvalues of the Grammian matrix for the data. Each of the 100 examples was then represented on the 8 eigen-vectors corresponding to the 8 largest eigenvalues and thus the data became 8-dimensional. It was found by using the algorithm of Ho and Kashyap [4] that in 8 dimensions the...
متن کامل